Additive approximation algorithms for modularity maximization
نویسندگان
چکیده
The modularity is the best known and widely used quality function for community detection in graphs. We investigate approximability of maximization problem some related problems. first design a polynomial-time 0.4209-additive approximation algorithm problem, which improves current additive error 0.4672. Our theoretical analysis also demonstrates that proposed obtains nearly-optimal solution any instance with high value. next 0.1660-additive maximum cut problem. Finally, we extend our to
منابع مشابه
Additive Approximation Algorithms for Modularity Maximization
The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected graph G = (V,E), we are asked to find a partition C of V that maximizes the modularity. Although numerous algorithms have been developed to date, most of them have no theoretical a...
متن کاملApproximation Algorithms for Free-Label Maximization
Inspired by applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points in the plane and labels that are unit squares, place a label with each point in P in such a way that the number of free labels (labels not intersecting any other label) is maximized. We develop efficient constant-factor approximation algorithms f...
متن کاملColumn generation algorithms for exact modularity maximization in networks.
Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [Phys. Rev. E 69, 026113 (2004)], is modularity maximization. Many heuristics have been proposed for maximizing modularity and yield rapidly near optimal solution or sometimes optimal ones but without a guarantee of optimality. There a...
متن کاملImproved Approximation Algorithms for k-Submodular Function Maximization
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{1/3, 1/(1+a)}-approximation by Ward and Živný [15], where a = max{1, √ (k − 1)/4}. We also show that for monotone ksubmodular functions there is a polynomial-time k/(2k− 1)-approximation algorithm while for any ε > 0 a ((k + 1)/2k + ε)-approxim...
متن کاملApproximation Algorithms for Indefinite Complex Quadratic Maximization Problems
In this paper we consider the following two types of complex quadratic maximization problems: (i) maximize zHQz, subject to z k = 1, k = 1, ..., n, where Q is a Hermitian matrix with tr Q = 0 and z ∈ C is the decision vector; (ii) maximize Re yHAz, subject to y k = 1, k = 1, ..., p, and z l = 1, l = 1, ..., q, where A ∈ Cp×q and y ∈ C and z ∈ C are the decision vectors. In the real cases (namel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2021
ISSN: ['1090-2724', '0022-0000']
DOI: https://doi.org/10.1016/j.jcss.2020.11.005